Space-Time Group Motion Planning
نویسندگان
چکیده
We present a novel approach for planning and directing heterogeneous groups of virtual agents based on techniques from linear programming. Our method efficiently identifies the most promising paths in both time and space and provides an optimal distribution of the groups’ members over these paths such that their average traveling time is minimized. The computed space-time plan is combined with an agent-based steering method to handle collisions and generate the final motions of the agents. Our overall solution is applicable to a variety of virtual environment applications, such as computer games and crowd simulators. We highlight its potential on different scenarios and evaluate the results from our simulations using a number of quantitative quality metrics. In practice, our system runs at interactive rates and can solve complex planning problems involving one or multiple groups.
منابع مشابه
Mobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کاملGraphbots: cooperative motion planning in discrete spaces
Most previous theoretical work on motion planning for a group of robots has addressed the problem of path planning for the individual robots sequentially, in geometrically simple regions of Euclidean space (e.g., a planar region containing polygonal obstacles). In this paper, we define a version of the motionplanning problem in which the robots move simultaneously. We establish conditions under...
متن کاملA Destination Driven Navigator with Dynamic Obstacle Motion Prediction
A real time navigating system, called Destination Driven Navigator, is developed. This paper presents a new obstacle representation method named Cross-Line, a new concept “work space” to reduce the robot’s search space and the environment storage cost, an Adapted Regression Model to predict the dynamic obstacles’ motion, and the Multi-State Path Repair rules to quickly translate an infeasible p...
متن کاملMotion planning amidst fat obstacles
The complexity of exact motion planning algorithms highly depends on the complexity of the robot’s free space, i.e., the set of all collision-free placements of the robot. Theoretically, the complexity of the free space can be very high. In practice, the complexity of the free space tends to be much smaller. We show that, under some realistic assumptions, the complexity of the free space of a r...
متن کاملCar-like Robots and Moving Obstacles Car-like Robots and Moving Obstacles
| This paper addresses motion planning for a car-like robot moving in a changing planar workspace, i.e. with moving obstacles. First, this motion planning problem is formulated in the state-time space framework. The state-time space of a robot is its state space plus the time dimension. In this framework part of the constraints at hand are translated into static forbidden regions of state-time ...
متن کاملMulti-agent Coordinated Motion Planning for Monitoring and Controlling the Observed Space in a Security Zone
Monitoring and control of observed space in a security zone equipped with multi cameras and security robots are essential for efficient invader detection. For controlling the observed space, a coordinated motion planning technique is essential when a centralized motion planning solution is realized by a single supervisory system. This technique, however, is known to be very difficult to realize...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012